Efficient Parallel Estimation for Markov Random Fields
نویسندگان
چکیده
We present a new , deterministic, distributed MAPes timation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The al gorithm has been applied to segmentation problems in computer vision and its performance compared with stochastic algorithms. The experiments show that Local HCF finds better estimates than stochas tic algorithms with much less computation.
منابع مشابه
Linear and Parallel Learning of Markov Random Fields
We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike its competitors, our algorithm is fully parallel and for log-linear models it is also data efficien...
متن کاملAsymptotically Efficient Parameter Estimation in Hidden Markov Spatio-temporal Random Fields
Estimation of the parameters of Markov random field models for spatial and temporal data arises in many applications. There are computational and statistical challenges in developing efficient estimators because of the complexity of the joint distribution of the spatio-temporal models, especially when they involve hidden states that also need to be estimated from the observations. We develop co...
متن کاملScalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields
This paper introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov Random Field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. Use of ne-grained, data parallel processing techniques yields real-time ...
متن کاملTelescoping Recursive Representations and Estimation of Gauss-Markov Random Fields
We present telescoping recursive representations for both continuous and discrete indexed noncausal Gauss-Markov random fields. Our recursions start at the boundary (for example, a hypersurface in R, d ≥ 1) and telescope inwards. Under appropriate conditions, the recursions for the random field are differential/difference representations driven by white noise, for which we can use standard recu...
متن کاملConstructing Composite Likelihoods in General Random Fields
We propose a simple estimator based on composite likelihoods for parameter learning in random field models. The estimator can be applied to all discrete graphical models such as Markov random fields and conditional random fields, including ones with higher-order energies. It is computationally efficient because it requires only inference over treestructured subgraphs of the original graph, and ...
متن کامل